Dense near polygons with two types of quads and three types of hexes
نویسنده
چکیده
We show that the number of points at distance i from a given point x in a dense near polygon only depends on i and not on the point x. We give a number of easy corollaries of this result. Subsequently, we look to the case of dense near polygons S with an order in which there are two possibilities for tQ, where Q is a quad of S, and three possibilities for (tH , vH), where H is a hex of S. Using the above-mentioned results, we will show that the number of quads of each type through a point is constant. We will also show that the number of hexes of each type through a point is constant if a certain matrix is nonsingular. If each hex is a regular near hexagon, a glued near hexagon or a product near hexagon, then that matrix turns out to be nonsingular in all but one of the eight possible cases. For the exceptional case, however, we provide an example of a near polygon that does not have a constant number of hexes of each type through each point.
منابع مشابه
Technical Effects of Air Cooled Blast Furnace Slag on Asphalt Mixtures
Air cooled blast furnace slag is a by product made of gradually air cooled molten blast furnace slag and is often stored in stockpiles near the iron mills and usually occupy a wide area around the iron mills. From this perspective the further use of these materials can have its own merits. Air cooled blast furnace slag can be used in asphalt mixtures because of their proper frictional propertie...
متن کاملThe Veldkamp Space of the Smallest Slim Dense Near Hexagon
We give a detailed description of the Veldkamp space of the smallest slim dense near hexagon. This space is isomorphic to PG(7, 2) and its 2 − 1 = 255 Veldkamp points (that is, geometric hyperplanes of the near hexagon) fall into five distinct classes, each of which is uniquely characterized by the number of points/lines as well as by a sequence of the cardinalities of points of given orders an...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملNumerical simulation of liquefaction susceptibility of soil interacting by single pile
Previous case histories have shown that soil liquefaction severely damaged many structures supported on pile foundations during earthquakes. As a result, evaluating the potential for instability is an important consideration for the safe and resistant design of deep foundation against earthquakes. In this study, the liquefaction susceptibility of saturated sand interacting by single concrete pi...
متن کاملLab and Field Scale Modeling of Near Miscible CO2 Injection in Different Porous Mediums
The main purpose of this investigation is to study the effect of near miscible CO2 injection in different porous mediums on both lab and field scales. This effect can be traced by the change of two-phase gas-oil relative permeability curves. In this work, the experiments have been performed on three rock types (i.e. sandstone, dolomite, and artificial fractured sandstone) based on an incrementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007